An Optimal Voting Scheme for Minimizing theOverall
نویسندگان
چکیده
Quorum consensus methods have been widely applied to managing replicated data. In this paper, we study the problem of voting assignments for minimizing the overall communication cost of processing typical demands of transactions. This problem was left open, even restricted to a uniform network. In this paper, we shall show that for uniform networks, it can be solved by an eecient polynomial time algorithm.
منابع مشابه
A Two-Threshold Guard Channel Scheme for Minimizing Blocking Probability in Communication Networks
In this paper, we consider the call admission problem in cellular network with two classes of voice users. In the first part of paper, we introduce a two-threshold guard channel policy and study its limiting behavior under the stationary traffic. Then we give an algorithm for finding the optimal number of guard channels. In the second part of this paper, we give an algorithm, which minimizes th...
متن کاملDesigning Incentive-based Demand Response Program for Minimizing Financial Risk of Retailer during Peak Period
In this paper, a customer incentive scheme is proposed for retailers to build an effective demand response program over the peak demand period to minimize the financial risk. Firstly, an objective function is formulated based on the market operation and an optimal incentive price is derived from this objective function. Secondly, the incentive price is employed as a part of an incentive scheme ...
متن کاملDouble voter perceptible blind signature based electronic voting protocol
Mu et al. have proposed an electronic voting protocol and claimed that it protects anonymity of voters, detects double voting and authenticates eligible voters. It has been shown that it does not protect voter's privacy and prevent double voting. After that, several schemes have been presented to fulfill these properties. However, many of them suffer from the same weaknesses. In this p...
متن کاملThe Theory and Implementation of an Electronic Voting System
We describe the theory behind a practical voting scheme based on homomorphic encryption. We give an example of an ElGamal-style encryption scheme, which can be used as the underlying cryptosystem. Then, we present efficient honest verifier zero-knowledge proofs that make the messages in the voting scheme shorter and easier to compute and verify, for voters as well as authorities, than in curren...
متن کاملAn Effective and Optimal Fusion Rule in the Presence of Probabilistic Spectrum Sensing Data Falsification Attack
Cognitive radio (CR) network is an excellent solution to the spectrum scarcity problem. Cooperative spectrum sensing (CSS) has been widely used to precisely detect of primary user (PU) signals. The trustworthiness of the CSS is vulnerable to spectrum sensing data falsification (SSDF) attack. In an SSDF attack, some malicious users intentionally report wrong sensing results to cheat the fusion c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007